Cyclic cycle systems of the complete multipartite graph
نویسندگان
چکیده
منابع مشابه
Existence of cyclic k-cycle systems of the complete graph
Starting from earliest papers by Rosa we solve, directly and explicitly, the existence problem for cyclic k-cycle systems of the complete graph Kv with v ≡ 1 (mod 2k), and the existence problem for cyclic k-cycle systems of the complete m-partite graph Km×k with m and k being odd. As a particular consequence, a cyclic p-cycle system of Kv with p being a prime exists for all admissible values of...
متن کاملCyclic Hamiltonian cycle systems of the complete graph
We prove that there exists a cyclic Hamiltonian k-cycle system of the complete graph if and only if k is odd but k = 15 and p with p prime and ¿ 1. As a consequence we have the existence of a cyclic k-cycle system of the complete graph on km vertices for any pair (k; m) of odd integers with k as above but (k; m) = (3; 3). c © 2003 Elsevier B.V. All rights reserved.
متن کامل(4, 5)-cycle Systems of Complete Multipartite Graphs
In 1981, Alspach conjectured that if 3 ≤ mi ≤ v, v is odd and v(v−1)/2 = m1+m2+· · ·+mt , then the complete graph Kv can be decomposed into t cycles of lengths m1, m2, . . . , mt respectively; if v is even, v(v − 2)/2 = m1 +m2 + · · ·+ mt, then the complete graph minus a one-factor Kv − F can be decomposed into t cycles of lengths m1, m2, . . . , mt respectively. In this paper, we extend the st...
متن کاملCyclic hamiltonian cycle systems of the complete graph minus a 1-factor
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn − I, exist if and only if n ≡ 2, 4( mod 8) and n 6= 2p with p prime and α ≥ 1.
متن کاملCyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
A cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form {F, F , F θ 2 , . . . , F θ q−1 } for some permutation θ of the vertex set V . Let Vn = {1, 2, . . . , n}. For a positive integer k, ( Vn k ) denotes the set of all k-subsets of Vn. For a nonempty subset K of Vn−1, we let K n denote the hypergraph ( Vn, ⋃ k∈K ( Vn k )) . In this paper, we find a necessary an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2019
ISSN: 1063-8539,1520-6610
DOI: 10.1002/jcd.21688